algorithmic information theory
algorithmic probability
– Mathematical method of assigning a prior probability to a given observation
Algorithmically random sequence
– Binary sequence
Chaitin's constant
– Halting probability of a random computer program
Computational indistinguishability
– In computer science, relationship between two families of distributions
Distribution ensemble
Epistemology
– Philosophical study of knowledge
Inductive reasoning
– Method of logical reasoning
Inductive probability
– Determining the probability of future events based on past events
Invariance theorem
Kolmogorov complexity
– Measure of algorithmic complexity
Minimum description length
– Model selection principle
Minimum message length
– Formal information theory restatement of Occam's Razor
Pseudorandom ensemble
Pseudorandom generator
– Formal concept in theoretical computer science and cryptography
Simplicity theory
Shannon's source coding theorem
– Establishes the limits to possible data compression
Solomonoff's theory of inductive inference
– Mathematical theory
https://en.wikipedia.org/wiki/Algorithmic_information_theory